Focused Natural Deduction
نویسندگان
چکیده
Natural deduction for intuitionistic linear logic is known to be full of non-deterministic choices. In order to control these choices, we combine ideas from intercalation and focusing to arrive at the calculus of focused natural deduction. The calculus is shown to be sound and complete with respect to first-order intuitionistic linear natural deduction and the backward linear focusing calculus.
منابع مشابه
The Focused Constraint Inverse Method for Intuitionistic Modal Logics
We present a focused inverse method for proof search in a variety of intuitionistic modal logics such as K, D, T, S4 and S5. Unification of worldpaths for such logics is non-unitary and therefore handled by adding constraints to sequents. We sketch proofs of soundness and completeness with respect to intuitionistic modal natural deduction and describe our implementation. Potential applications ...
متن کاملPath-Focused Duplication: rocedure for
The mating paradigm for automated theorem provers was proposed by Andrews to avoid some of the shortcomings in resolution. It facilitates automated deduction in higher-order and non-classical logics. Moreover, there are procedures which translate back and forth between refutations by the mating method and proofs in a natural deduction system. We describe a search procedure, called path-focused ...
متن کاملStrong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedd...
متن کاملSequent Calculus and Equational Programming
Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We show here that the equational approach corresponds to the use of a focused presentation of a type theory expressed as a sequent calculus. A ty...
متن کاملCanonical Sequent Proofs via Multi-Focusing
The sequent calculus admits many proofs of the same conclusion that differ only by trivial permutations of inference rules. In order to eliminate this “bureaucracy” from sequent proofs, deductive formalisms such as proof nets or natural deduction are usually used instead of the sequent calculus, for they identify proofs more abstractly and geometrically. In this paper we recover permutative can...
متن کامل